Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(a,f(b,f(a,x))) |
→ f(a,f(b,f(b,f(a,x)))) |
| 2: |
|
f(b,f(b,f(b,x))) |
→ f(b,f(b,x)) |
|
There are 2 dependency pairs:
|
| 3: |
|
F(a,f(b,f(a,x))) |
→ F(a,f(b,f(b,f(a,x)))) |
| 4: |
|
F(a,f(b,f(a,x))) |
→ F(b,f(b,f(a,x))) |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006